package ink.lovejinhu.leetcodeMatch;

import java.util.Arrays;

/**
 * @Author: jin
 * @Date: 2021/8/29 11:08
 * @Version: V1.0
 * @Slogan: Great people are not born great, but show their greatness in the process of growing up
 **/
public class Solution_5856 {
    /**
     * 每次任务刚好筹够sessionTime是最快的
     *
     * @param tasks
     * @param sessionTime
     * @return
     */
    public int minSessions(int[] tasks, int sessionTime) {
        Arrays.sort(tasks);

        for (int i = tasks.length - 1; ; i--) {
            /**
             * 选0个到n-1个
             */
            for (int j = 0; j <= tasks.length - 1; j++) {

            }
        }

    }



}
